The monotonicity of f - vectors of random polytopes ̊ Olivier Devillers
نویسندگان
چکیده
Let K be a compact convex body in R, let Kn be the convex hull of n points chosen uniformly and independently in K, and let fipKnq denote the number of i-dimensional faces of Kn. We show that for planar convex sets, Erf0pKnqs is increasing in n. In dimension d ě 3 we prove that if limnÑ8 Erfd ́1pKnqs Anc “ 1 for some constants A and c ą 0 then the function n ÞÑ Erfd ́1pKnqs is increasing for n large enough. In particular, the number of facets of the convex hull of n random points distributed uniformly and independently in a smooth compact convex body is asymptotically increasing. Our proof relies on a random sampling argument.
منابع مشابه
The monotonicity of f-vectors of random polytopes
Let K be a compact convex body in R, let Kn be the convex hull of n points chosen uniformly and independently in K, and let fipKnq denote the number of i-dimensional faces of Kn. We show that for planar convex sets, Erf0pKnqs is increasing in n. In dimension d ě 3 we prove that if limnÑ8 Erfd ́1pKnqs An “ 1 for some constants A and c ą 0 then the function n ÞÑ Erfd ́1pKnqs is increasing for n lar...
متن کاملf-vectors of random polytopes
Let K be a compact convex body in R, let Kn be the convex hull of n points chosen uniformly and independently in K, and let fipKnq denote the number of i-dimensional faces of Kn. We show that for planar convex sets, Erf0pKnqs is increasing in n. In dimension d ě 3 we prove that if limnÑ8 Erfd ́1pKnqs An “ 1 for some constants A and c ą 0 then the function n ÞÑ Erfd ́1pKnqs is increasing for n lar...
متن کاملBanach-Mazur Distances and Projections on Random Subgaussian Polytopes
We consider polytopes in Rn that are generated by N vectors in Rn whose coordinates are independent subgaussian random variables. (A particular case of such polytopes are symmetric random ±1 polytopes generated by N independent vertices of the unit cube.) We show that for a random pair of such polytopes the Banach-Mazur distance between them is essentially of a maximal order n. This result is a...
متن کاملChecking the Convexity of Polytopes and the Planarity of Subdivisions (Extended Abstract)
This paper studies the problem of verifying the correctness of geometric structures. In particular, we design optimal checkers for convex polytopes in two and higher dimensions, and for various types of planar subdivisions, such as triangulations, Delaunay triangulations, and convex subdivisions. Our checkers are simpler and more general than the ones previously described in the literature. The...
متن کامل